Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa Mfa

100 Integer Multiplication with Over ow Detection or Saturation Michael J. Schulte, Pablo I. Balzola, Ahmet Akkas, and Robert W. Brocato Abstract|High-speed multiplication is frequently used in general-purpose and application-speci c computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least signi cant bits of the product and a ag that indicates whether or not over ow has occurred. Alternatively, some processors saturate results that over ow to the most positive or most negative representable number. This paper presents e cient methods for performing unsigned or two's complement integer multiplication with over ow detection or saturation. These methods have signi cantly less area and delay than conventional methods for integer multiplication with over ow detection or saturation. Keywords| Over ow, saturation, two's complement, unsigned, integer, array multipliers, tree multipliers, computer arithmetic.